home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
The CICA Windows Explosion!
/
The CICA Windows Explosion! - Disc 2.iso
/
programr
/
eckelt01.zip
/
14
/
APPLIST.CPP
next >
Wrap
C/C++ Source or Header
|
1995-02-23
|
3KB
|
99 lines
// File from page 637 in "Thinking in C++" by Bruce Eckel
//////////////////////////////////////////////////
// From the compressed package ECKELT01.ZIP 2/21/95
// Copyright (c) Bruce Eckel, 1995
// Source code file from the book "Thinking in C++",
// Prentice Hall, 1995, ISBN: 0-13-917709-4
// All rights reserved EXCEPT as allowed by the following
// statements: You may freely use this file for your own
// work, including modifications and distribution in
// executable form only. You may copy and distribute this
// file, as long as it is only distributed in the complete
// (compressed) package with the other files from this
// book and you do not remove this copyright and notice.
// You may not distribute modified versions of the source
// code in this package. This package may be freely placed
// on bulletin boards, internet nodes, shareware disks and
// product vendor disks. You may not use this file in
// printed media without the express permission of the
// author. Bruce Eckel makes no
// representation about the suitability of this software
// for any purpose. It is provided "as is" without express
// or implied warranty of any kind. The entire risk as to
// the quality and performance of the software is with
// you. Should the software prove defective, you assume
// the cost of all necessary servicing, repair, or
// correction.
// If you think you've found an error, please
// email all modified files with loudly commented changes
// to: eckel@aol.com (please use the same
// address for non-code errors found in the book).
//////////////////////////////////////////////////
//: APPLIST.CPP -- Apply a function to a tstack
#include "..\14\tstack.h"
#include <iostream.h>
// 0 arguments, any type of return value:
template<class T, class R>
void applist(tstack<T>& tl, R(T::*f)()) {
tstackIterator<T> it(tl);
while(it) {
(it.current()->*f)();
it++;
}
}
// 1 argument, any type of return value:
template<class T, class R, class A>
void applist(tstack<T>& tl, R(T::*f)(A), A a) {
tstackIterator<T> it(tl);
while(it) {
(it.current()->*f)(a);
it++;
}
}
// 2 arguments, any type of return value:
template<class T, class R, class A1, class A2>
void applist(tstack<T>& tl, R(T::*f)(A1, A2),
A1 a1, A2 a2) {
tstackIterator<T> it(tl);
while(it) {
(it.current()->*f)(a1, a2);
it++;
}
}
// Etc., to handle maximum probable arguments
class gromit { // The techno-dog
int arf;
public:
gromit(int Arf = 1) : arf(Arf + 1) {}
void speak(int) {
for(int i = 0; i < arf; i++)
cout << "arf! ";
cout << endl;
}
char eat(float) {
cout << "chomp!" << endl;
return 'z';
}
int sleep(char, double) {
cout << "zzz..." << endl;
return 0;
}
void sit(void) {}
};
main() {
tstack<gromit> dogs;
for(int i = 0; i < 5; i++)
dogs.push(new gromit(i));
applist(dogs, &gromit::speak, 1);
applist(dogs, &gromit::eat, 2.0f);
applist(dogs, &gromit::sleep, 'z', 3.0);
applist(dogs, &gromit::sit);
}